1073A - Diverse Substring - CodeForces Solution


implementation strings *1000

Please click on ads to support us..

Python Code:

n = int(input())
s = input()
ans = None
ch = s[0]
for i in range(1,n):
    if s[i]!=ch:
        ans = ch+s[i]
        break
if ans==None:
    print("NO")
else:
    print("YES")
    print(ans)

C++ Code:

#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
    int n;
    string s;
    cin>>n>>s;
    if (n==1) {cout<<"NO\n"; return 0;}
    for (int i=0 ; i<n-1 ; i++) {
        if (s[i]!=s[i+1]) {
            cout<<"YES\n";
            cout<<s[i]<<s[i+1];
            return 0;
        }
    }
    cout<<"NO\n";
}

 	 	 					 		 	 		  	   	   			


Comments

Submit
0 Comments
More Questions

1490B - Balanced Remainders
264A - Escape from Stones
1506A - Strange Table
456A - Laptops
855B - Marvolo Gaunt's Ring
1454A - Special Permutation
1359A - Berland Poker
459A - Pashmak and Garden
1327B - Princesses and Princes
1450F - The Struggling Contestant
1399B - Gifts Fixing
1138A - Sushi for Two
982C - Cut 'em all
931A - Friends Meeting
1594A - Consecutive Sum Riddle
1466A - Bovine Dilemma
454A - Little Pony and Crystal Mine
2A - Winner
1622B - Berland Music
1139B - Chocolates
1371A - Magical Sticks
1253A - Single Push
706B - Interesting drink
1265A - Beautiful String
214A - System of Equations
287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways